<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
   "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<head>
    <title>Jumper</title>
    <link rel="stylesheet" href="../ldoc.css" type="text/css" />
</head>
<body>

<div id="container">

<div id="product">
	<div id="product_logo"></div>
	<div id="product_name"><big><b></b></big></div>
	<div id="product_description"></div>
</div> <!-- id="product" -->


<div id="main">


<!-- Menu -->

<div id="navigation">
<br/>
<h1>Jumper</h1>

<ul>
  <li><a href="../index.html">Index</a></li>
</ul>



<h2>Scripts</h2>
<ul>
  <li><strong>bheap</strong></li>
  <li><a href="../scripts/grid.html">grid</a></li>
  <li><a href="../scripts/heuristics.html">heuristics</a></li>
  <li><a href="../scripts/jumper.html">jumper</a></li>
</ul>
<h2>Modules</h2>
<ul>
  <li><a href="../modules/init.html">init</a></li>
</ul>

</div>

<div id="content">

<h1>Script <code>bheap</code></h1>

<p><strong>A light implementation of <code>binary heaps</code></strong>.</p>
<p> The graph search algorithm implemented here is a mix of
 <a href="http://harablog.wordpress.com/2011/09/07/jump-point-search/">Jump point Search</a> and <a href="http://en.wikipedia.org/wiki/A_star">A*</a>
 algorithms. A* works by maintaining a list of nodes called <strong>open list</strong>.
 Finding in this list the lowest cost node from the node being processed is a slow operation,
 as it requires to skim through the collection of nodes stored in this list.</p>

<p> The current modules implements a <a href="http://www.policyalmanac.org/games/binaryHeaps.htm">Binary Heaps</a> class, a priority queue data structure.
 As such, lookup for lowest-cost node is faster, and globally makes the search algorithm run faster.</p>

<p> This module should not normally be used explicitely. The algorithm uses it internally.</p>
    <h3>Info:</h3>
    <ul>
        <li><strong>Copyright</strong>: 2012-2013</li>
        <li><strong>License</strong>: <a href="http://www.opensource.org/licenses/mit-license.php">MIT</a></li>
        <li><strong>Author</strong>: Roland Yonaba</li>
    </ul>



<br/>
<br/>




</div> <!-- id="content" -->
</div> <!-- id="main" -->
<div id="about">
<i>generated by <a href="http://github.com/stevedonovan/LDoc">LDoc 1.3</a></i>
</div> <!-- id="about" -->
</div> <!-- id="container" -->
</body>
</html>
